Binary set functions and parity check matrices
نویسندگان
چکیده
منابع مشابه
Binary set functions and parity check matrices
We consider the possibility of extending to a family of sets a binary set function defined on a subfamily so that the extension is, in fact, uniquely determined. We place in this context the problem of finding the least integer n(r) such that every linear code of length n with n B n(r), dimension n r and minimum Hamming distance at least 4 has a parity check matrix composed entirely of odd weig...
متن کاملOn Sparse Parity Check Matrices
We consider the extremal problem to determine the maximal number N(m; k; r) of columns of a 0-1-matrix with m rows and at most r ones in each column such that each k columns are linearly independent modulo 2. For each xed k 1 and r 1, we shall prove a probabilistic lower bound N(m; k; r) = (m kr=2(k?1)); for k a power of 2, we prove an upper bound N(m; k; r) = O(m dkr=(k?1)e=2) which matches th...
متن کاملSparse Parity-Check Matrices over ${GF(q)}$
For fixed positive integers k, q, r with q a prime power and large m, we investigate matrices with m rows and a maximum number Nq(m, k, r) of columns, such that each column contains at most r nonzero entries from the finite field GF (q) and each k columns are linearly independent over GF (q). For even integers k ≥ 2 we obtain the lower bounds Nq(m, k, r) = Ω(m kr/(2(k−1))), and Nq(m, k, r) = Ω(...
متن کاملOptimization of Non Binary Parity Check Coefficients
This paper generalizes the method proposed by Pouillat et al. for the determination of the optimal Galois Field coefficients of a Non-Binary LDPC parity check constraint based on the binary image of the code. Optimal, or almost-optimal, parity check coefficients are given for check degree varying from 4 to 20 and Galois Field varying from GF(64) up to GF(1024). For all given sets of coefficient...
متن کاملA fast low-density parity-check code simulator based on compressed parity-check matrices
Low-density parity-check (LDPC) codes are very powerful error-correction codes with capabilities approaching the Shannon’s limits. In evaluating the error performance of a LDPC code, the computer simulation time taken becomes a primary concern when tens of millions of noise-corrupted codewords are to be decoded, particularly for codes with very long lengths. In this paper, we propose modeling t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1990
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90245-d